//#include<iostream>

//#include<iostream>
//const int N = 1e6 + 10;
//using namespace std;
//int a[N], b, c[N];
//int main()
//{
//	string s1, s2;cin >> s1 >> b;
//	int la = s1.size();
//	for (int i = 0; i < la; i++)
//	{
//		a[i] = s1[la - i - 1] - '0';
//	}
//	int t = 0;
//	for (int i = la - 1; i >= 0; i--)
//	{
//		t = t * 10 + a[i];
//		c[i] = t / b;
//		t = t % b;
//	}
//	while (c[la - 1] == 0 && la > 1) la--;
//	for (int i = la; i >= 0; i--)
//	{
//		cout << c[i];
//	}
//	return 0;
//}
////#include<iostream>
////using namespace std;
////const int N = 200;
////int num[N][N];
////int main()
////{
////	int a;cin >> a;
////	int i, j;
////	a[i][j] = a[i][j - 1] + a[i - 1][j] - a[i - 1][j - 1] + a;
////	sum[i][j] = sum[i - 1][j] - sum[i][j - 1] + sum[i - 1][j - 1];
////
////
////	return 0;
////}
//////#include<iostream>
//////#include<string>
//////#include<set>
//////using namespace std;
//////int main()
//////{
//////	multiset<int> mp;
//////	int a[] = { 3,5,7,2,3,3,34,76,24,46 };
//////	int sz = sizeof(a) / sizeof(a[0]);
//////	for (int i = 0; i < sz; i++)
//////	{
//////		mp.insert(a[i]);
//////	}
//////	for (auto v : mp)
//////	{
//////		cout << v << ' ';
//////	}
//////	
//////	return 0;
//////}